On the Complexity of the Abelian Sandpile Model: Communication Complexity and Statistical Mechanics
نویسنده
چکیده
In this paper, the complexity of recognizing the critical configurations of the two-dimensional Abelian sandpile model is studied, some known facts are reviewed, and a simplified proof of the burning test is presented. Then, the existence of sublinear time algorithms solving the aforementioned problem is studied, with a lower bound for the monotone complexity of the problem established by employing some tools of communication complexity.
منابع مشابه
Connections, Communication and Collaboration in Healthcare’s Complex Adaptive Systems; Comment on “Using Complexity and Network Concepts to Inform Healthcare Knowledge Translation”
A more sophisticated understanding of the unpredictable, disorderly and unstable aspects of healthcare organisations is developing in the knowledge translation (KT) literature. In an article published in this journal, Kitson et al introduced a new model for KT in healthcare based on complexity theory. The Knowledge Translation Complexity Network Model (KTCNM) provides a fresh perspective by mak...
متن کاملTwo Notes on the Computational Complexity of One-Dimensional Sandpiles
We prove that the one-dimensional sandpile prediction problem is in AC. The previously best known upper bound on the AC-scale was AC. We also prove that it is not in AC1− for any constant
متن کاملThe Complexity of Three-Dimensional Critical Avalanches
In this work we study the complexity of the three-dimensional sandpile avalanches triggered by the addition of two critical con gurations. We prove that the algorithmic problem consisting in predicting the evolution of three dimensional critical avalanches is P -complete and 6 p n-strict hard for P . On the other hand we prove that three-dimensional avalanches are superlinear long on average. I...
متن کاملComputational Complexity of Avalanches in the Kadanoff Two-dimensional Sandpile Model
In this paper we prove that the avalanche problem for Kadanoff sandpile model (KSPM) is P-complete for two-dimensions. Our proof is based on a reduction from the monotone circuit value problem by building logic gates and wires which work with configurations in KSPM. The proof is also related to the known prediction problem for sandpile which is in NC for one-dimensional sandpiles and is P-compl...
متن کاملComputational Complexity of Avalanches in the Kadanoff Two-dimensional Sandpile Model
In this paper we prove that the avalanche problem for the Kadanoff sandpile model (KSPM) is P-complete for two-dimensions. Our proof is based on a reduction from the monotone circuit value problem by building logic gates and wires which work with configurations in KSPM. The proof is also related to the known prediction problem for sandpile which is in NC for one-dimensional sandpiles and is P-c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Complex Systems
دوره 21 شماره
صفحات -
تاریخ انتشار 2013